Cooperative Multisite Production Re-scheduling
نویسندگان
چکیده
One of the main issues in cooperative enterprise planning and scheduling is how to re-assign tasks without involving too many components of every enterprise and implying too many changes in the whole system. We propose a new system that is able to re-schedule tasks in cooperative multisite production automatically avoiding one of the main problems that have schedule programmers that are in charge of two or more cooperative enterprises. The system is based on making virtual groups of machines that perform the same tasks and establishes links between machines from different groups. We will describe the algorithm in detail and we will validate it using a case of study. Results show that our proposal gives better performance.
منابع مشابه
Cooperative Supply Chain Re-scheduling: The Case of an Engine Supply Chain
One of the main issues on task planning of the enterprises with several production sites is how they can reassign tasks when a part of the supply chain is stopped. In this case, a good re-schedule, involving parts from supply chains from other sites, could imply to reduce overall costs. In this paper, we propose a cooperative system to re-schedule a network chain. The algorithm proposed is desc...
متن کاملAgent-based approach for cooperative scheduling
This paper studies the multi-factory production (MFP) network scheduling problem where a number of different individual factories join together to form a MFP network, in which these factories can operate more economically than operating individually. However, in such network which known as virtual production network with self-interested factories with transportation times, each individual facto...
متن کاملAn Agent-Based Cooperative Mechanism for Integrated Production and Transportation Planning
This paper presents a decentralized cooperative economic scheduling mechanism for a supply chain environment. For this purpose, we design autonomous agents that minimize the production or transportation and outsourcing costs incurred by the external execution of a task. The decentralized cooperative scheduling approach comprises two parts: the individual optimization of an agent’s local schedul...
متن کاملSolving Re-entrant No-wait Flexible Flowshop Scheduling Problem; Using the Bottleneck-based Heuristic and Genetic Algorithm
In this paper, we study the re-entrant no-wait flexible flowshop scheduling problem with makespan minimization objective and then consider two parallel machines for each stage. The main characteristic of a re-entrant environment is that at least one job is likely to visit certain stages more than once during the process. The no-wait property describes a situation in which every job has its own ...
متن کاملA Scheduling Model for the Re-entrant Manufacturing System and Its Optimization by NSGA-II
In this study, a two-objective mixed-integer linear programming model (MILP) for multi-product re-entrant flow shop scheduling problem has been designed. As a result, two objectives are considered. One of them is maximization of the production rate and the other is the minimization of processing time. The system has m stations and can process several products in a moment. The re-entrant flow sho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008